Lexicographic beliefs and assumption
نویسندگان
چکیده
منابع مشابه
Lexicographic beliefs and assumption
Foundations for iterated admissibility (i.e., the iterated removal of weakly dominated strategies) need to confront a fundamental challenge. On the one hand, admissibility requires that a player consider every strategy of their opponents possible. On the other hand, reasoning that the opponents are rational requires ruling out certain strategies. Brandenburger, Friedenberg and Keisler’s (BFK, E...
متن کاملPerfect equilibrium and lexicographic beliefs
We extend the results of Blume, Brandenberger, and Dekel (1991b) to obtain a finite characterization of perfect equilibria in terms of lexicographic probability systems (LPSs). The LPSs we consider are defined over individual strategy sets and thus capture the property of independence among players’ actions. Our definition of a product LPS over joint actions of the players is shown to be canoni...
متن کاملAgreeing to disagree with lexicographic prior beliefs
The robustness of Aumann’s seminal agreement theorem with respect to the common prior assumption is considered. More precisely, we show by means of an example that two Bayesian agents with almost identical prior beliefs can agree to completely disagree on their posterior beliefs. Secondly, a more detailed agent model is introduced where posterior beliefs are formed on the basis of lexicographic...
متن کاملReverse Lexicographic and Lexicographic Shifting
A short new proof of the fact that all shifted complexes are fixed by reverse lexicographic shifting is given. A notion of lexicographic shifting, ∆lex — an operation that transforms a monomial ideal of S = k[xi : i ∈ N] that is finitely generated in each degree into a squarefree strongly stable ideal — is defined and studied. It is proved that (in contrast to the reverse lexicographic case) a ...
متن کاملLexicographic Flow
The lexicographic flow problem is a flow problem in which the edges are assigned priorities, and we wish to find a flow that is lexicographically maximum with respect to the priority assignment. The problem is reducible to a weighted flow problem, but we show that exponentially large weights are necessary in general. We then give an efficient direct algorithm that does not use weights.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Economic Theory
سال: 2016
ISSN: 0022-0531
DOI: 10.1016/j.jet.2016.03.003